Design of compact acoustic models through clustering of tied-covariance Gaussians

نویسندگان

  • Mark Z. Mao
  • Vincent Vanhoucke
چکیده

We propose a new approach for designing compact acoustic models particularly suited to large systems that combine multiple model sets to represent distinct acoustic conditions or languages. We show that Gaussians based on mixtures of inverse covariances (MIC) with shared parameters can be clustered using an efficient Lloyd algorithm. As a result, more compact acoustic models can be built by clustering Gaussians across tied mixtures. In addition, we show that the tied parameters of MIC models can be shared across acoustic models and languages, making it possible to build more efficient multi-model systems which take advantage of a common pool of clustered Gaussians.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dimensional reduction, covariance modeling, and computational complexity in ASR systems

In this paper, we study acoustic modeling for speech recognition using mixtures of exponential models with linear and quadratic features tied across all context dependent states. These models are one version of the SPAM models introduced in [1]. They generalize diagonal covariance, MLLT, EMLLT, and full covariance models. Reduction of the dimension of the acoustic vectors using LDA/HDA projecti...

متن کامل

Pruning of state-tying tree using bayesian information criterion with multiple mixtures

The use of context-dependent phonetic units together with Gaussian mixture models allows modern-day speech recognizer to build very complex and accurate acoustic models. However, because of data sparseness issue, some sharing of data across di erent triphone states is necessary. The acoustic model design is typically done in two stages, namely, designing the state-tying map and growing the numb...

متن کامل

Accuracy versus complexity in context dependent phone modeling

This paper presents two di erent directions to build HMM models which give enough acoustic resolution and t in limited user resources. They both refer to scaling down the acoustic models which are built with tied gaussian HMMs. The total number of gaussians is reduced by a pairwise merging, and the number of gaussians per state is reduced by selecting them based on the so called occupancy crite...

متن کامل

Robust HMM estimation with Gaussian merging-splitting and tied-transform HMMs

We present two different approaches for robust estimation of the parameters of context-dependent hidden Markov models (HMMs) for speech recognition. The first approach, the Gaussian MergingSplitting (GMS) algorithm, uses Gaussian splitting to uniformly distribute the Gaussians in acoustic space, and merging so as to compute only those Gaussians that have enough data for robust estimation. We sh...

متن کامل

Fast clustering of Gaussians and the virtue of representing Gaussians in exponential model format

This paper aims to show the power and versatility of exponential models by focusing on exponential model representations of Gaussian Mixture Models (GMMs). In a recent series of papers by several authors, GMMs of varying structure and complexity have been considered. These GMMs can all be readily represented as exponential models and oftentimes favorably so. This paper shows how the exponential...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004